A Further Consideration on the HK and the CMG regions for the Interference Channel

نویسنده

  • Kingo Kobayashi
چکیده

We present a simplified form of the HK (= HanKobayashi) achievable rate region for the general interference channel by using Fourier-Motzkin algorithm, as well as a simplified form of the HK region without the don’t care inequalities. Also, in the same spirit, we give an improved form of the CMG (= Chong-Motani-Garg) region. I. THE ORIGINAL HK ACHIEVABLE REGION Let ω(y1y2|x1x2) be an interference channel with two inputs x1, x2 and two outputs y1, y2. In order to establish an achievable rate region for the general interference channel, Han and Kobayashi [1] started with the introduction of a preparatory rate region SHK(Z) (for each Z ∈ P∗) of (S1, T1, S2, T2)’s that are expressed in terms of four auxiliary random variables U1, U2,W1,W2 and a time sharing parameter Q. Here, P∗ is the set of all Z = QU1W1U2W2X1X2Y1Y2 such that i) U1,W1, U2,W2 are conditionally independent given Q; ii) X1 = f1(U1,W1|Q), X2 = f2(U2,W2|Q) ; iii) Pr{Y1 = y1, Y2 = y2|X1 = x1, X2 = x2} = ω(y1y2|x1x2), where f1(·, ·|·) and f2(·, ·|·) are deterministic functions. With these notations, SHK(Z) is defined as the set of all (S1, T1, S2, T2) such that S1 ≤ a1, (1) T1 ≤ b1, (2) T2 ≤ c1, (3) S1 + T1 ≤ d1, (4) S1 + T2 ≤ e1, (5) T1 + T2 ≤ f1, (6) S1 + T1 + T2 ≤ g1, (7) −S1 ≤ 0, (8) −T1 ≤ 0, (9)

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Rate Region for General Interference Channel (Improved HK Region)

In this paper (a) after detailed investigation of the previous equivalent rate regions for general interference channel, i.e., the Han-Kobayashi (HK) and the Chong-Motani-Garg (CMG) regions, we define modified CMG region the equivalency of which with the HK region is readily seen; (b) we make two novel changes in the HK coding. First, we allow the input auxiliary random variables to be correlat...

متن کامل

Improvement of the Han-Kobayashi Rate Region for General Interference Channel-v2

Allowing the input auxiliary random variables to be correlated and using the binning scheme, the HanKobayashi (HK) rate region for general interference channel is partially improved. The obtained partially new achievable rate region (i) is compared to the HK region and its simplified description, i.e., Chong-Motani-Garg (CMG) region, in a detailed and favorable manner, by considering different ...

متن کامل

Improvement of the Han-Kobayashi Rate Region for General Interference Channel

Allowing the input auxiliary random variables to be correlated and using the binning scheme, the HanKobayashi (HK) rate region for general interference channel is improved. The obtained new achievable rate region (i) is shown to encompass the HK region and its simplified description, i.e., Chong-Motani-Garg (CMG) region, considering a detailed and favorable comparison between different versions...

متن کامل

Achievable Secrecy Rate Regions of State Dependent Causal Cognitive Interference Channel

In this paper, the secrecy problem in the state dependent causal cognitive interference channel is studied. The channel state is non-causally known at the cognitive encoder. The message of the cognitive encoder must be kept secret from the primary receiver. We use a coding scheme which is a combination of compress-and-forward strategy with Marton coding, Gel’fand-Pinsker coding and Wyner’s wire...

متن کامل

On The Secrecy of the Cognitive Interference Channel with Channel State

In this paper the secrecy problem in the cognitive state-dependent interference channel is considered. In this scenario we have a primary and a cognitive transmitter-receiver pairs. The cognitive transmitter has the message of the primary sender as side information. In addition, the state of the channel is known at the cognitive encoder. Hence, the cognitive encoder uses this side information t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007